Learning Read-constant Polynomials of Constant Degree over Arbitrary Moduli

Boolean functions that have constant-degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class ACC. They are also precisely the functions computable efficiently by programs over fixed and finite nilpotent groups. This class is not known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomial time algorithm for learning boolean functions represented by polynomials of constant degree over arbitrary finite rings from Membership queries, with the additional constraint that each variable in the target polynomial appears in a constant number of variables. Our algorithm extends to superconstant but low degree polynomials and still runs in quasipolynomial time.